Random walks on the world input–output network
نویسندگان
چکیده
منابع مشابه
Random Walks on Small World Networks
We study the mixing time of random walks on small-world networks modelled as follows: starting with the 2-dimensional periodic grid, each pair of vertices {u, v} with distance d > 1 is added as a “long-range” edge with probability proportional to d−r, where r ≥ 0 is a parameter of the model. Kleinberg studied a close variant of this network model and proved that the (decentralised) routing time...
متن کاملTraversal times for random walks on small-world networks.
We study the mean traversal time for a class of random walks on Newman-Watts small-world networks, in which steps around the edge of the network occur with a transition rate that is different from the rate for steps across small-world connections. When f>>F, the mean time to traverse the network exhibits a transition associated with percolation of the random graph (i.e., small-world) part of th...
متن کاملScaling properties of random walks on small-world networks.
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These properties include the average number of distinct sites visited by the random walker, the mean-square displacement of the walker, and the distribution of fir...
متن کاملRandom walks on the Apollonian network with a single trap
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node with the highest degree), which are simultaneously scale-free and small-world. We obtain the precise analytic expression for the MFPT that is confirmed by dir...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complex Networks
سال: 2017
ISSN: 2051-1310,2051-1329
DOI: 10.1093/comnet/cnx036